Wallace trees are the theoretically fastest multi operand adders, which can be used for obtaining the sum of partial products. However, their complex interconnections do not permit practical implementation. 理论上Wallace树结构加法器是乘法器中完成部分积求和的最快的多操作数加法器,但其互连复杂难于实现。